A new bandwidth guaranteed routing algorithm for MPLS traffic engineering

In this paper, we present a new online algorithm for dynamically routing bandwidth guaranteed label switched paths (LSPs). LSP set-up requests are represented in terms of a pair of ingress and egress routers as well as its bandwidth requirement, and arrive one by one. There is no a priori knowledge regarding future LSP set-up requests and their characteristics. Our proposed algorithm considers not only the importance of critical links, but also the degree of their importance to routing possible future LSP set-up requests by characterizing their normalized bandwidth contribution to routing future LSP demands. Moreover, link residual bandwidth information, i.e., the link’s capability of routing future LSPs, is also incorporated. Simulation results show that our proposed algorithm performs better than the best known bandwidth guaranteed routing algorithm, the minimum interference routing algorithm, in terms of LSP rejection rate under both static and dynamic LSP set-up request arrivals.